منابع مشابه
Infinite Random Geometric Graphs
We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in a metric space, and vertices are adjacent independently with probability p ∈ (0, 1) if the metric distance between the vertices is below a given threshold. If V is a countable dense set in R equipped with the metric derived from the L∞-norm, then it is shown that with probability 1 such infini...
متن کاملInfinite Random Geometric Graphs Extended Abstract
We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in a metric space, and vertices are adjacent independently with probability p ∈ (0, 1) if the metric distance between the vertices is below a given threshold. If V is a countable dense set in R equipped with the metric derived from the L∞-norm, then it is shown that with probability 1 such infini...
متن کاملInfinite Random Geometric Graphs from the Hexagonal Metric
We consider countably infinite random geometric graphs, whose vertices are points in R, and edges are added independently with probability p ∈ (0, 1) if the metric distance between the vertices is below a given threshold. Assume that the vertex set is randomly chosen and dense in R. We address the basic question: for what metrics is there a unique isomorphism type for graphs resulting from this...
متن کاملInfinite Locally Random Graphs
Motivated by copying models of the web graph, Bonato and Janssen [3] introduced the following simple construction: given a graph G, for each vertex x and each subset X of its closed neighbourhood, add a new vertex y whose neighbours are exactly X. Iterating this construction yields a limit graph ↑G. Bonato and Janssen claimed that the limit graph is independent of G, and it is known as the infi...
متن کاملDynamic Random Geometric Graphs
We provide the first analytical results for the connectivity of dynamic random geometric graphs-a model of mobile wireless networks in which vertices move in random (and periodically updated) directions, and an edge exists between two vertices if their Euclidean distance is below a given threshold. We provide precise asymptotic results for the expected length of the connectivity and disconnecti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Combinatorics
سال: 2011
ISSN: 0218-0006,0219-3094
DOI: 10.1007/s00026-011-0111-8